
@online{fightingTyporaZoteroGaoDingMarkdownSuiXieSuiYin2020,
  title = {Typora+{{zotero搞定Markdown随写随引}}},
  author = {Fighting, Leon},
  date = {2020-07-23},
  url = {https://zhuanlan.zhihu.com/p/163196155?msclkid=ea03d26fb68d11ec83102576759890a1},
  urldate = {2022-04-08},
  organization = {{Typora+zotero搞定Markdown随写随引}}
}

@inproceedings{franklandEvolvingGamePlaying2015,
  title = {Evolving Game Playing Strategies for {{Othello}}},
  booktitle = {2015 {{IEEE Congress}} on {{Evolutionary Computation}} ({{CEC}})},
  author = {Frankland, Clive and Pillay, Nelishia},
  date = {2015-05},
  pages = {1498--1504},
  publisher = {{IEEE}},
  location = {{Sendai, Japan}},
  doi = {10.1109/CEC.2015.7257065},
  url = {http://ieeexplore.ieee.org/document/7257065/},
  urldate = {2022-07-10},
  abstract = {There has been a fair amount of research into the use of genetic programming for the induction of game playing strategies for board games such as chess, checkers, backgammon and Othello. A majority of this research has focused on developing evaluation functions for use with standard game playing algorithms such as the alpha-beta algorithm or Monte Carlo tree search. The research presented in this paper proposes a different approach based on heuristics. Genetic programming is used to evolve game playing strategies composed of heuristics. Each evolved strategy represents a player. While in previous work the game playing strategies are generally created offline, in this research learning and generation of the strategies takes place online, in real time. An initial population of players created using the ramped half-and-half method is iteratively refined using reproduction, mutation and crossover. Tournament selection is used to choose parents. The board game Othello, also known as Reversi, is used to illustrate and evaluate this novel approach. The evolved players were evaluated against human players, Othello WZebra, AI Factory Reversi and Math is fun Reversi. This study has revealed the potential of the proposed novel approach for evolving game playing strategies for board games. It has also identified areas for improvement and based on this future work will investigate mechanisms for incorporating mobility into the evolved players.},
  eventtitle = {2015 {{IEEE Congress}} on {{Evolutionary Computation}} ({{CEC}})},
  isbn = {978-1-4799-7492-4},
  langid = {english},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\NBU6ICKF\\Frankland 和 Pillay - 2015 - Evolving game playing strategies for Othello.pdf}
}

@online{HanYuPinYinZhengCiFaJiBenGuiZeGuoJiaBiaoZhunGB,
  title = {《汉语拼音正词法基本规则》（国家标准） {{GB}}/{{T}} 16159-2012},
  url = {https://www.htu.edu.cn/yw/2018/1008/c14252a129573/page.htm},
  urldate = {2022-04-23},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\4XILDEN6\\page.html}
}

@book{luosuRenGongZhi2013,
  title = {Ren gong zhi neng},
  author = {{Luo su} and {Nuo wei ge} and {Yin jian ping}},
  date = {2013},
  publisher = {{Qing hua ta xue chu ban she}},
  location = {{Bei jing}},
  abstract = {Ben shu de zui xin ban quan mian er xi tong di jie shao le ren gong zhi neng de li lun he shi jian, Chan shu le ren gong zhi neng ling yu de he xin nei rong, Bing shen ru jie shao le ge ge zhu yao de yan jiu fang xiang.},
  isbn = {978-7-302-33109-4},
  langid = {chinese},
  annotation = {OCLC: 910429591}
}

@inproceedings{maNewImprovedAlgrithom2019,
  title = {A {{New Improved Algrithom}} of {{Two-Dimensional Closest Point Pair}}},
  booktitle = {2019 {{IEEE}} 5th {{International Conference}} on {{Computer}} and {{Communications}} ({{ICCC}})},
  author = {Ma, Jun and Zhan, Bang Cheng and Li, Feng},
  date = {2019},
  pages = {29--33},
  doi = {10.1109/ICCC47050.2019.9064062},
  abstract = {The problem of two-dimensional closest point pair is the basic problem in the process of geometry research and computer development. And other areas such as aviation also involve it. For this problem, this paper first introduces the current research status, and then proposes an improved algorithm with lower time complexity based on the classical algorithm (making the time complexity of the algorithm reduce to 4/3nlgn). Moreover, a new point pair detection theorem is proposed, which can determine the number of detection points according to the region, making the algorithm more efficient.},
  eventtitle = {2019 {{IEEE}} 5th {{International Conference}} on {{Computer}} and {{Communications}} ({{ICCC}})},
  keywords = {Air traffic control,closest point pair,component,divide and conquer algorithm,Geometry,improvement,time complexity,Time complexity,Two dimensional displays,two-dimensional}
}

@online{MarkdownConvenientAcademic2020,
  title = {Markdown for Convenient Academic Writing | {{Ben Butterworth}}},
  date = {2020-05-28T00:00:00},
  url = {https://orth.uk/markdown-for-convenient-academic-writing/},
  urldate = {2022-07-10},
  abstract = {Read this if you think LaTex is too complicated, and you want to focus on writing content, and not practically programming the LaTex document.},
  langid = {english},
  file = {D\:\\Program Go\\Zotero\\storage\\228ZZVSB\\markdown-for-convenient-academic-writing.html}
}

@online{NewImprovedAlgrithom,
  title = {A {{New Improved Algrithom}} of {{Two-Dimensional Closest Point Pair}} | {{IEEE Conference Publication}} | {{IEEE Xplore}}},
  url = {https://ieeexplore.ieee.org/document/9064062},
  urldate = {2022-07-10},
  file = {D\:\\Program Go\\Zotero\\storage\\JPLMC6V4\\9064062.html}
}

@online{NewImprovedAlgrithoma,
  title = {A {{New Improved Algrithom}} of {{Two-Dimensional Closest Point Pair}} | {{IEEE Conference Publication}} | {{IEEE Xplore}}},
  url = {https://ieeexplore.ieee.org/document/9064062},
  urldate = {2022-07-10}
}

@online{NewImprovedAlgrithomb,
  title = {A {{New Improved Algrithom}} of {{Two-Dimensional Closest Point Pair}} | {{IEEE Conference Publication}} | {{IEEE Xplore}}},
  url = {https://ieeexplore.ieee.org/document/9064062},
  urldate = {2022-07-10}
}

@inproceedings{olivitoFPGAImplementationStrong2010,
  title = {{{FPGA}} Implementation of a Strong {{Reversi}} Player},
  booktitle = {2010 {{International Conference}} on {{Field-Programmable Technology}}},
  author = {Olivito, Javier and Gonzalez, Carlos and Resano, Javier},
  date = {2010-12},
  pages = {507--510},
  publisher = {{IEEE}},
  location = {{Beijing, China}},
  doi = {10.1109/FPT.2010.5681469},
  url = {http://ieeexplore.ieee.org/document/5681469/},
  urldate = {2022-07-10},
  abstract = {In this article, we present a design of a Reversi player submitted to the FPT’10 Design Competition and implemented on a XC2VP30 Virtex-II Pro FPGA.},
  eventtitle = {2010 {{International Conference}} on {{Field-Programmable Technology}} ({{FPT}})},
  isbn = {978-1-4244-8980-0},
  langid = {english},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\C7JMNJCS\\Olivito 等。 - 2010 - FPGA implementation of a strong Reversi player.pdf}
}

@article{pengzhijunJiSuanJiBoYiSuanFaZaiHeiBaiQiZhongDeYingYong2021,
  title = {计算机博弈算法在黑白棋中的应用},
  author = {{彭之军}},
  date = {2021},
  journaltitle = {现代信息科技},
  volume = {5},
  number = {17},
  pages = {73-77+81},
  issn = {2096-4706},
  doi = {10.19850/j.cnki.2096-4706.2021.17.018},
  url = {https://kns.cnki.net/KCMS/detail/detail.aspx?dbcode=CJFD&dbname=CJFDLAST2022&filename=XDXK202117019&v=},
  abstract = {计算机博弈是人工智能的重要分支之一,文章对人工智能算法黑白棋中的应用进行了研究。首先介绍了计算机博弈中的经典黑白棋算法,然后介绍深度强化学习中两种典型的时间差分算法的定义和实现过程,以及两者的区别和联系。最后评测蒙特卡洛树搜索算法、Q学习算法和SARSA算法三种算法在黑白棋实际应用的表现,以及后续改进的方向。},
  langid = {zh\_CN},
  keywords = {deep reinforcement learning,Markov decision process,Q learning,Q学习,SARSA,SARSA MCTS,深度强化学习,蒙特卡洛树搜索,马尔科夫决策过程},
  file = {D\:\\Program Go\\Zotero\\storage\\LGBTLEBP\\计算机博弈算法在黑白棋中的应用_彭之军.pdf}
}

@article{reggianiExtendedKalmanFilter2018,
  title = {Extended {{Kalman Filter}} for {{MIMO Phase Noise Channels With Independent Oscillators}}},
  author = {Reggiani, Luca and Dossi, Laura and Barletta, Luca and Spalvieri, Arnaldo},
  date = {2018-06},
  journaltitle = {IEEE Communications Letters},
  volume = {22},
  number = {6},
  pages = {1200--1203},
  issn = {1558-2558},
  doi = {10.1109/LCOMM.2018.2791590},
  abstract = {The Kalman filter is proposed here to track the phase noise introduced by independent transmit and receive oscillators in multiple-input multiple-output transmission. To take advantage of pilot symbols that are transmitted before and after the time instant where one wants to estimate the vector of phases, a forward-backward Kalman filter is proposed. To reduce the complexity of the Kalman filter, suboptimal methods are introduced and their performance is compared with that of the full complexity Kalman filter by computer simulation.},
  eventtitle = {{{IEEE Communications Letters}}},
  keywords = {Kalman filters,MIMO communication,Multiple-input multiple-output (MIMO),Noise measurement,phase noise,Phase noise,Simulation},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\S3QUM6U7\\Reggiani 等。 - 2018 - Extended Kalman Filter for MIMO Phase Noise Channe.pdf;C\:\\Users\\YeCanming\\Zotero\\storage\\ZGSS5AA5\\8253485.html}
}

@article{russellRenGongZhiNengYiZhongXianDaiDeFangFa2013,
  title = {人工智能:一种现代的方法},
  shorttitle = {人工智能},
  author = {Russell, Stuartj. and {PeterNorvig} and {诺维格} and {罗素} and {祝恩} and {殷建平}},
  date = {2013},
  journaltitle = {清华大学出版社},
  doi = {9787302331094},
  url = {https://xueshu.baidu.com/usercenter/paper/show?paperid=3ea17f427b46d814759922e4ec067e71&site=xueshu_se&hitarticle=1},
  urldate = {2022-07-10},
  abstract = {本书是最权威、最经典的人工智能教材, 已被全世界100多个国家的1200多所大学用作教材。本书的最新版全面而系统地介绍了人工智能的理论和实践, 阐述了人工智能领域的核心内容, 并深入介绍了各个主要的研究方向。},
  keywords = {人工智能}
}

@article{russellRenGongZhiNengYiZhongXianDaiDeFangFa2013a,
  title = {人工智能:一种现代的方法},
  author = {Russell, Stuartj and PeterNorvig and 诺维格 and 罗素 and 祝恩 and 殷建平},
  date = {2013},
  journaltitle = {清华大学出版社}
}

@online{TyporaZoteroGaoDingMarkdownSuiXieSuiYin,
  title = {Typora+zotero搞定Markdown随写随引},
  url = {https://zhuanlan.zhihu.com/p/163196155},
  urldate = {2022-07-10},
  abstract = {使用工具及简要安装Typora超级好用的免费Markdown编辑器，在尝试了多款Markdown软件之后，我选择了它。下载链接： [Typora官网] https://www.typora.io/ Zotero文献管理软件，插件Better Bibtex必须安装。 相关的…},
  langid = {chinese},
  organization = {{知乎专栏}},
  file = {D\:\\Program Go\\Zotero\\storage\\RW64DIQ5\\163196155.html}
}

@online{WenXianGuanLiRuanJianZoteroDaoRuWenXianDeWuZhongFangShiJiu,
  title = {文献管理软件//{{Zotero导入文献的五种方式}}（九）\_跳动的喵尾巴的博客-{{CSDN博客}}\_zotero导入文献},
  url = {https://blog.csdn.net/qq_43210428/article/details/120459203},
  urldate = {2022-07-10},
  file = {D\:\\Program Go\\Zotero\\storage\\7LB25Z9C\\120459203.html}
}

@online{WenXianGuanLiRuanJianZoteroDeChangYongChaJianZotero,
  title = {文献管理软件//{{Zotero的常用插件}}——{{Zotero}} Translators//知网下载//知乎翻译器+{{Jasminum}}（茉莉花）（四）\_跳动的喵尾巴的博客-{{CSDN博客}}\_zotero翻译插件},
  url = {https://blog.csdn.net/qq_43210428/article/details/120377475},
  urldate = {2022-07-10},
  file = {D\:\\Program Go\\Zotero\\storage\\PZXUSHQV\\120377475.html}
}

@online{WenXianGuanLiRuanJianZoteroDeChangYongChaJianZoteroa,
  title = {文献管理软件//{{Zotero的常用插件}}——{{Zotero}} Translators//知网下载//知乎翻译器+{{Jasminum}}（茉莉花）（四）\_跳动的喵尾巴的博客-{{CSDN博客}}\_zotero翻译插件},
  url = {https://blog.csdn.net/qq_43210428/article/details/120377475},
  urldate = {2022-07-10},
  file = {D\:\\Program Go\\Zotero\\storage\\UGDFGGXI\\120377475.html}
}

@thesis{xieZhongGuoXiangQiJiQiBoYiShuJuJieGouSheJiYuSouSuoSuanFaYanJiu2008,
  type = {硕士},
  title = {中国象棋机器博弈数据结构设计与搜索算法研究},
  author = {谢, 国},
  date = {2008},
  institution = {{西安理工大学}},
  url = {https://kns.cnki.net/KCMS/detail/detail.aspx?dbcode=CMFD&dbname=CMFD2009&filename=2008160692.nh&v=},
  abstract = {人工智能(AI)是计算机知识、心理学和哲学等知识的综合体现。中国象棋的计算机博弈属于人工智能的研究范畴。目前黑白棋、五子棋、国际象棋等棋类的计算机博弈已经取得了成功,而博弈树更为庞大的中国象棋计算机博弈尚处于萌芽阶段。本课题结合在中国象棋机器博弈方面的实践经验,对中国象棋计算机博弈做了详细的分析和研究,主要做了以下工作:首先,设计了中国象棋计算机博弈软件的数据结构,对马和象的着法生成采用模版匹配法,并且根据路向行向比特向量对车、炮等棋子的着法生成采用预置表法。由于采用模版匹配法和预置表法省去了棋子边界的判断,并且利用查询代替搜索,提高了着法生成的速度,进而提高了整个博弈树的搜索效率,该部分的工作是整个程序的基础。另外,研究了博弈树的搜索算法。在alpha-beta搜索算法的基础上,采用极小窗口(PvS)、置换表启发、历史表启发、静态启发等启发算法,有效的提高了搜索的效率;采用静态搜索、选择性延伸等手段,避免了在叶子节点由于棋子交换、将军等因素导致的估值剧烈波动而带来的评估风险;采用空着前向裁剪(NULLMOVE)使得搜索深度在原来基础上增加了2～3层,并且完善了空着前向裁剪的条件判断,使得采用该方法更稳定。最后,简要描述了棋局的评估要点。对各种算法编程实现,实践结果表明了算法可行性,并表现出了良好的性能。},
  editora = {钱, 富才},
  editoratype = {collaborator},
  langid = {chinese},
  keywords = {computer game,evaluation function,game tree searching,中国象棋,人机博弈,博弈树搜索,评估函数 Chinese chess},
  annotation = {20 citations(CNKI)[2022-7-11]},
  file = {D\:\\Program Go\\Zotero\\storage\\QFS5B8G6\\中国象棋机器博弈数据结构设计与搜索算法研究.pdf}
}

@inreference{ZIPFileFormat2022,
  title = {{{ZIP}} (File Format)},
  booktitle = {Wikipedia},
  date = {2022-03-07T04:47:10Z},
  url = {https://en.wikipedia.org/w/index.php?title=ZIP_(file_format)&oldid=1075692296},
  urldate = {2022-04-20},
  abstract = {ZIP is an archive file format that supports lossless data compression. A ZIP file may contain one or more files or directories that may have been compressed. The ZIP file format permits a number of compression algorithms, though DEFLATE is the most common. This format was originally created in 1989 and was first implemented in PKWARE, Inc.'s PKZIP utility, as a replacement for the previous ARC compression format by Thom Henderson. The ZIP format was then quickly supported by many software utilities other than PKZIP. Microsoft has included built-in ZIP support (under the name "compressed folders") in versions of Microsoft Windows since 1998 via the "Windows Plus!" addon for Windows 98. Native support was added as of the year 2000 in Windows ME. Apple has included built-in ZIP support in Mac OS X 10.3 (via BOMArchiveHelper, now Archive Utility) and later. Most free operating systems have built in support for ZIP in similar manners to Windows and Mac OS X. ZIP files generally use the file extensions .zip or .ZIP and the MIME media type application/zip. ZIP is used as a base file format by many programs, usually under a different name. When navigating a file system via a user interface, graphical icons representing ZIP files often appear as a document or other object prominently featuring a zipper.},
  langid = {english},
  annotation = {Page Version ID: 1075692296},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\5Z9KGXKU\\ZIP_(file_format).html}
}

@incollection{zotero-15,
  type = {incollection}
}

@online{ZoteroLianHeMarkdown,
  title = {zotero 联合 markdown 软件-以思源笔记为例},
  url = {https://zhuanlan.zhihu.com/p/463073230},
  urldate = {2022-07-10},
  abstract = {2021年我做的三个比较重要的选择： 思源笔记：这两年笔记软件，百花齐放（卷的不行），兜兜转转，我选择了思源笔记（之前使用onenote，某象、蚂蚁笔记等也试过，偶尔看一下obsidian。思源笔记是个人知识库软件，上…},
  langid = {chinese},
  organization = {{知乎专栏}},
  file = {D\:\\Program Go\\Zotero\\storage\\FD6C97NX\\463073230.html}
}

@online{ZoteroYourPersonal,
  title = {Zotero | {{Your}} Personal Research Assistant},
  url = {https://www.zotero.org/start},
  urldate = {2022-04-07},
  file = {C\:\\Users\\YeCanming\\Zotero\\storage\\US6RZVC2\\start.html}
}


